Secure pseudo-random linear binary sequences generators based on arithmetic polynoms
نویسندگان
چکیده
We present a new approach to constructing of pseudo-random binary sequences (PRS) generators for the purpose of cryptographic data protection, secured from the perpetrator’s attacks, caused by generation of masses of hardware errors and faults. The new method is based on use of linear polynomial arithmetic for the realization of systems of boolean characteristic functions of PRS’ generators. “Arithmetizatio” of systems of logic formulas has allowed to apply mathematical apparatus of residue systems for multisequencing of the process of PRS generation and organizing control of computing errors, caused by hardware faults. This has guaranteed high security of PRS generator’s functioning and, consequently, security of tools for cryptographic data protection based on those PRSs.
منابع مشابه
Linear solutions for cryptographic nonlinear sequence generators
This letter shows that linear Cellular Automata based on rules 90/150 generate all the solutions of linear difference equations with binary constant coefficients. Some of these solutions are pseudo-random noise sequences with application in cryptography: the sequences generated by the class of shrinking generators. Consequently, this contribution shows that shrinking generators do not provide e...
متن کاملProving Lower Bounds Via Pseudo-random Generators
In this paper, we formalize two stepwise approaches, based on pseudo-random generators, for proving P 6= NP and its arithmetic analog: Permanent requires superpolynomial sized arithmetic circuits.
متن کاملA Unified View of Long-period Random Number Generators
Two types of linear congruent.ial random number generator are considered: the conventional one using integer arithmetic and another using polynomial arithmetic over finite fields. We show t.hat most of the long-period random number generators currently used or recently proposed, which include multiple re.:ursive generators, shift register generators, add-with-carry and subtract-with-borrow gene...
متن کاملSecure Arithmetic Computation with Constant Computational Overhead
We study the complexity of securely evaluating an arithmetic circuit over a finite field F in the setting of secure two-party computation with semi-honest adversaries. In all existing protocols, the number of arithmetic operations per multiplication gate grows either linearly with log |F| or polylogarithmically with the security parameter. We present the first protocol that only makes a constan...
متن کاملIPASJ International Journal of Information Technology (IIJIT)
In this paper, we tend to develop a replacement cellular automata-based linear model for many nonlinear pseudorandom variety generators with sensible applications in parallel cryptography. Such a model generates all the solutions of linear binary distinction equations similarly as several of those solutions area unit pseudo-random keystream sequences. during this method, a linear structure supp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1409.2248 شماره
صفحات -
تاریخ انتشار 2014